Randomness, Stochasticity, and Approximations
نویسندگان
چکیده
منابع مشابه
Cdmtcs Research Report Series Randomness, Stochasticity and Approximations Randomness, Stochasticity and Approximations
Polynomial time unsafe approximations for intractable sets were introduced by Meyer and Paterson [9] and Yesha [19] respectively. The question of which sets have optimal unsafe approximations has been investigated extensively, see, e.g., [1, 5, 15, 16]. Recently, Wang [15, 16] showed that polynomial time random sets are neither optimally unsafe approximable nor -levelable. In this paper, we wil...
متن کاملKolmogorov-Loveland Randomness and Stochasticity
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounded gain in the limit while betting successively on bits of X . A sequence X is KL-stochastic if there is no computable non-monotonic selection rule that selects from X an infinite, biased sequence. One of the major open ...
متن کاملResource-Bounded Balanced Genericity, Stochasticity and Weak Randomness
We introduce balanced t(n)-genericity which is a reenement of the genericity concept of Ambos-Spies, Fleischhack and Huwig 2] and which in addition controls the frequency with which a condition is met. We show that this concept coincides with the resource-bounded version of Church's stochasticity 6]. By uniformly describing these concepts and weaker notions of stochasticity introduced by Wilber...
متن کاملGenericity, Randomness, and Polynomial-Time Approximations
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge, MA, 1979] and Yesha [SIAM J. Comput., 12 (1983), pp. 411–425], respectively. The question of which sets have optimal safe and unsafe approximations has been investigated extensively. Duris and Rolim [Lecture Notes in...
متن کاملKolmogorov stochasticity parameter measuring the randomness in the cosmic microwave background
The Kolmogorov stochasticity parameter (KSP) is applied to quantify the degree of randomness (stochasticity) in the temperature maps of the Cosmic Microwave Background radiation maps. It is shown that the KSP for the WMAP5 maps is about twice as high as that of the simulated maps for the concordance ΛCDM cosmological model, implying that a randomizing effect exists that has not been taken into ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 1999
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s002240000130